On the universal Gröbner bases of toric ideals of graphs
نویسندگان
چکیده
To any graph G can be associated a toric ideal I G. In this talk some recent joint work with Enrique Reyes and Christos Tatakis will be presented on the toric ideal of a graph. A characterization in graph theoretical terms of the elements of the Graver basis and the universal Gröbner basis of the toric ideal of a graph will be given. The Graver basis is the union of the primitive binomials of the toric ideal and the universal Gröbner basis of an ideal is a Gröbner basis with respect to all term orders simultaneously. Finally, examples of graphs will be presented for which the true degrees of their circuits are less than the degrees of some elements of the Graver basis.
منابع مشابه
Ring graphs and complete intersection toric ideals
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideal...
متن کاملGraver Bases and Universal Gröbner Bases for Linear Codes
Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal Gröbner bases can be computed.
متن کاملOn a family of projective toric varieties
By means of suitable sequences of graphs, in a previous paper, we have studied the reduced lexicographic Gröbner bases of a family of homogeneous toric ideals. In this paper, we deepen the analysis of those bases and derive some geometric properties of the corresponding projective toric varieties.
متن کاملProperties of Cut Ideals Associated to Ring Graphs
A cut ideal of a graph records the relations among the cuts of the graph. These toric ideals have been introduced by Sturmfels and Sullivant who also posed the problem of relating their properties to the combinatorial structure of the graph. We study the cut ideals of the family of ring graphs, which includes trees and cycles. We show that they have quadratic Gröbner bases and that their coordi...
متن کاملDualistic computational algebraic analyses of primal and dual minimum cost flow problems on acyclic tournament graphs
To integer programming problems, computational algebraic approaches using Gröbner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time complexity bound compared with existing methods for solving integer programming problems, these give algebraic analysis of their structures. In this paper, we focus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011